Multireceiver Authentication Codes: Models, Bounds, Constructions, and Extensions
نویسندگان
چکیده
Multireceiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we give a formal dee-nition of multireceiver authentication codes, derive information theoretic and combinatorial lower bounds on their performance and give new eecient and exible constructions for such codes. Finally we extend the basic model to the case that multiple messages are sent and the case that the sender can be any member of the group.
منابع مشابه
Bounds and Constructions for Multireceiver Authentication Codes
Multireceiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we give a formal deenition of multireceiver authentication codes, derive information theoretic and combinatorial lower bounds on their performance and give new eecient constructions for such cod...
متن کاملTwo Constructions of Multireceiver Authentication Codes from Singular Symplectic Geometry over Finite Fields
Multireceiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, two constructions of multireceiver authentication codes from singular symplectic geometry over finite fields are given. The parameters and the probabilities of success for different types of dec...
متن کاملBroadcast authentication for group communication
Traditional point-to-point message authentication systems have been extensively studied in the literature. In this paper, we consider authentication systems for group communication. The basic primitive is a multireceiver authentication system with dynamic senders (DMRA-code). In a DMRA-code any member of the group can broadcast an authenticated message to the rest of the group such that every o...
متن کاملA General Construction for 1-Round δ-RMT and (0, δ)-SMT
In Secure Message Transmission (SMT) problem, a sender S is connected to a receiver R through N node disjoint bidirectional paths in the network, t of which are controlled by an adversary with unlimited computational power. S wants to send a message m to R in a reliable and private way. It is proved that SMT is possible if and only if N ≥ 2t+1. In Reliable Message Transmission (RMT) problem, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 151 شماره
صفحات -
تاریخ انتشار 1999